Integral Images for Block Matching

The integral image representation is a remarkable idea that permits to evaluate the sum of image values over rectangular regions of the image with four operations, regardless of the size of the region. It was first proposed under the name of summed area table in the computer graphics community by Crow’84, in order to efficiently filter texture maps. It was later popularized in the computer vision community by Viola & Jones’04 with its use in their real-time object detection framework. In this article we describe the integral image algorithm and study its application in the context of block matching. We investigate tradeoffs and the limits of the performance gain with respect to exhaustive block matching. Source Code The source code and the online demo are accessible from the IPOL web page of this article1.